Approximation algorithms for weighted matching
نویسندگان
چکیده
منابع مشابه
Efficient Approximation Algorithms for Weighted b-Matching
We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a specified number b(v) of edges in M are incident on each vertex v. Subject to this restriction we...
متن کاملParalle Approximation Algorithms for Maximum Weighted Matching in General Graphs
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem. The rst is an RNC-approximation scheme, i.e., an RNC algorithm that computes a matching of weight at least 1 times the maximum for any given constant > 0. The second one is an NC approximation algor...
متن کاملParallel Approximation Algorithms for the Weighted Maximum Matching Problem
We consider the problem of computing a matching in a large weighted graph using a parallel algorithm. Since an exact algorithm for the weighted matching problem is fairly costly we instead develop a fast approximation algorithm. The parallel algorithm is based on a distributed algorithm due to Hoepman [6]. Through experiments using both complete as well as sparse graphs we show that our new alg...
متن کاملParallel Approximation Algorithms for Maximum Weighted Matching in General Graphs
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem. The first is an RNC-approximation scheme, i.e., an RNC algorithm that computes a matching of weight at least 1 − times the maximum for any given constant > 0. The second one is an NC approximation a...
متن کاملFast Parallel Approximation Algorithms for Maximum Weighted Matching Problem
We present two parallel approximation algorithms for nding a matching of maximum weight in a given edge-weighted graph. To deal with unbounded weights e ciently on a PRAM, the algorithms only use the total order of the weights. That is, we assume that the algorithms can only compare with weights of edges. The rst algorithm deterministically runs in O(log n) time. Its approximation ratio is 2 3 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1987
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90022-3